Enumerating Planar Minimally Rigid Graphs
نویسندگان
چکیده
We present an algorithm for enumerating without repetitions all the planar (noncrossing) minimally rigid (Laman) graphs embedded on a given generic set of n points. Our algorithm is based on the Reverse search paradigm of Avis and Fukuda. It generates each output graph in O(n) time and O(n) space, or, with a slightly different implementation, in O(n) time and O(n) space. In particular, we obtain that the set of all planar Laman graphs on a given point set is connected by flips which remove an edge and then restore the Laman property with the addition of a non-crossing edge.
منابع مشابه
An upper bound on Euclidean embeddings of rigid graphs with 8 vertices
A graph is called (generically) rigid in Rd if, for any choice of sufficiently generic edge lengths, it can be embedded in Rd in a finite number of distinct ways, modulo rigid transformations. Here, we deal with the problem of determining the maximum number of planar Euclidean embeddings of minimally rigid graphs with 8 vertices, because this is the smallest unknown case in the plane. Until now...
متن کاملThe Number of Embeddings of Minimally Rigid Graphs
Rigid frameworks in some Euclidean space are embedded graphs having a unique local realization (up to Euclidean motions) for the given edge lengths, although globally they may have several. We study the number of distinct planar embeddings of minimally rigid graphs with n vertices. We show that, modulo planar rigid motions, this number is at most ( 2n−4 n−2 ) ≈ 4n . We also exhibit several fami...
متن کاملAlgebraic Methods for Counting Euclidean Embeddings of Rigid Graphs
The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings of such graphs, up to rigid motions, in Euclidean space. We focus on lower bounds and on tight bounds for small cases, in R 2 and R, where Laman graphs and 1-skeleta of convex simplicial polyhedra, respectively, admit inductiv...
متن کاملAn Inductive Construction for Plane Laman Graphs via Vertex Splitting
We prove that all planar Laman graphs (i.e. minimally generically rigid graphs with a non-crossing planar embedding) can be generated from a single edge by a sequence of vertex splits. It has been shown recently [6,12] that a graph has a pointed pseudo-triangular embedding if and only if it is a planar Laman graph. Due to this connection, our result gives a new tool for attacking problems in th...
متن کاملEnumerating Rooted Biconnected Planar Graphs with Internally Triangulated Faces
A graph is called a triangulated planar graph if it admits a plane embedding in the plane such that all inner faces are triangle. In a rooted triangulated planar graph, a vertex and two edges incident to it are designated as an outer vertex and outer edges, respectively. Two plane embedding of rooted triangulated planar graphs are defined to be equivalent if they admit an isomorphism such that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005